1925B - A Balanced Problemset - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000010000
#define endl '\n'

//factors of x
vector<int> factorization(int x) {
    vector<int> fac;
    for (int i = 1; i * i <= x; i++) {
        if (x % i == 0) {
            fac.push_back(i);
            if (i != x / i) {
                fac.push_back(x / i);
            }
        }
    }
    return fac;
}


void solve(){
	int x,n;
	cin>>x>>n;
	vector<int>fac = factorization(x);

	sort(fac.begin(),fac.end());
	auto it = lower_bound(fac.begin(), fac.end(), n);
    
    if (it != fac.end()) {
        cout << (x / *it )<< endl;
    } else {
        cout << "1" << endl;  // Handle the case when no factor is found
    }
}
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int _t; cin>>_t;while(_t--)
	solve();
}